Norm convergence of realistic projection and reflection methods
نویسندگان
چکیده
منابع مشابه
Norm Convergence of Realistic Projection and Reflection Methods
The (2-set) convex feasibility problem asks for a point contained within the intersection of two closed convex sets of a Hilbert space. Projection and reflection methods represent a class of algorithmic schemes which are commonly used to solve this problem. Some notable projection and reflection methods include the method of alternating projections, the Douglas–Rachford method, the cyclic Dougl...
متن کاملsome properties of fuzzy hilbert spaces and norm of operators
in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...
15 صفحه اولConvergence and Perturbation Resilience of Dynamic String-Averaging Projection Methods
We consider the convex feasibility problem (CFP) in Hilbert space and concentrate on the study of string-averaging projection (SAP) methods for the CFP, analyzing their convergence and their perturbation resilience. In the past, SAP methods were formulated with a single predetermined set of strings and a single predetermined set of weights. Here we extend the scope of the family of SAP methods ...
متن کاملa comparison of teachers and supervisors, with respect to teacher efficacy and reflection
supervisors play an undeniable role in training teachers, before starting their professional experience by preparing them, at the initial years of their teaching by checking their work within the proper framework, and later on during their teaching by assessing their progress. but surprisingly, exploring their attributes, professional demands, and qualifications has remained a neglected theme i...
15 صفحه اولHilbertian Convex Feasibility Problem: Convergence of Projection Methods∗
The classical problem of finding a point in the intersection of countably many closed and convex sets in a Hilbert space is considered. Extrapolated iterations of convex combinations of approximate projections onto subfamilies of sets are investigated to solve this problem. General hypotheses are made on the regularity of the sets and various strategies are considered to control the order in wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization
سال: 2014
ISSN: 0233-1934,1029-4945
DOI: 10.1080/02331934.2014.947499